Angel method for discrete optimization problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model- and Method Base System for Discrete Optimization Problems

Methods of discrete optimization play an important role in the area of control and optimization of industrial processes. Due to the fact that most discrete optimization problems are NP-complete, a lot of specialized methods have been developed for them, which differ with respect to algorithmic properties, see e.g [5, 7]. For this reason a user is not always able to select the algorithm that fit...

متن کامل

Discrete Bilevel Optimization Problems

Bilevel programming problems are hierarchical optimization problems in which the feasible set is determined by the set of optimal solutions of a second, parametric optimization problem. In this paper we consider problems where this second problem is a discrete one. We start with addressing the problem of the existence of optimal solutions. Then, an algorithm is proposed solving these problems. ...

متن کامل

A FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

متن کامل

collocation discrete least square (cdls) method for elasticity problems

a meshless approach, collocation discrete least square (cdls) method, is extended in this paper, for solvingelasticity problems. in the present cdls method, the problem domain is discretized by distributed field nodes. the fieldnodes are used to construct the trial functions. the moving least-squares interpolant is employed to construct the trialfunctions. some collocation points that are indep...

متن کامل

Discrete Optimization Problems for Radiation Therapy Planning

A well-studied problem in intensity modulated radiation therapy (IMRT) is the representation of a given intensity matrix, i.e. a matrix of nonnegative integers, as a nonnegative linear combination of special 0-1-matrices, called segments. These segments can be practically realized by multileaf collimators (MLC). One important aim is the minimization of the sum of the coefficients of the linear ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Periodica Polytechnica Civil Engineering

سال: 2007

ISSN: 0553-6626,1587-3773

DOI: 10.3311/pp.ci.2007-2.06